Efficient Mining of Profit Rules from Closed Inter-Transaction Itemsets
نویسندگان
چکیده
Data mining applications in financial sectors are very common since investors can apply the resultant rules to make profits. Profit mining algorithms in particular, such as PRMiner, can generate profit rules that meet the expectations of investors regarding profit, risk, and win rate. However, most of such algorithms are not efficient due to the long processing time involving going through the whole search space in complex dynamical systems of financial markets. Hence, we propose a new approach in this paper to solve the problem by using closed itemsets to obtain profit rules without processing the entire trading rules. Based on the inter-day modeling, we analyze inter-transactions and conduct trading simulations to predict trading results for efficient profit rule generation. We develop two algorithms of JCMiner and ATMiner to process closed itemsets, which have better performance than the approach of PRMiner, especially for the large number of itemsets and large datasets. According to the experimental results, our algorithms outperform PRMiner in various experimental scenarios, i.e., mining parameters, the number of items in a transaction, and the number of transactions in a dataset.
منابع مشابه
An efficient algorithm for mining closed inter-transaction itemsets
In this paper, we propose an efficient algorithm, called ICMiner (Inter-transaction Closed patterns Miner), for mining closed inter-transaction itemsets. Our proposed algorithm consists of two phases. First, we scan the database once to find the frequent items. For each frequent item found, the ICMiner converts the original transaction database into a set of domain attributes, called a dataset....
متن کاملEfficient Mining of Cross-Transaction Web Usage Patterns in Large Database
Web Usage Mining is the application of data mining techniques to large Web log databases in order to extract usage patterns. A cross-transaction association rule describes the association relationships among different user transactions in Web logs. In this paper, a Linear time intra-transaction frequent itemsets mining algorithm and the closure property of frequent itemsets are used to mining c...
متن کاملAn Efficient Algorithm to Mine Online Data Streams
Mining frequent closed itemsets provides complete and condensed information for non-redundant association rules generation. Extensive studies have been done on mining frequent closed itemsets, but they are mainly intended for traditional transaction databases and thus do not take data stream characteristics into consideration. In this paper, we propose a novel approach for mining closed frequen...
متن کاملAn Efficient Method for Mining Frequent Weighted Closed Itemsets from Weighted Item Transaction Databases
1 Division of Data Science, Ton Duc Thang University, Ho Chi Minh, Viet Nam 4 2 Faculty of Information Technology, Ton Duc Thang University, Ho Chi Minh, Viet Nam 5 [email protected], [email protected] 6 7 Abstract: In this paper, a method for mining frequent weighed closed itemsets (FWCIs) 8 from weighted item transaction databases is proposed. The motivation for FWCIs is that 9 frequent ...
متن کاملTGC-Tree: An Online Algorithm Tracing Closed Itemset and Transaction Set Simultaneously
Finding Association Rules is a classical data mining task. The most critical part of Association Rules Mining is finding the frequent itemsets in the database. Since the introduce of the famouse Apriori algorithm [14], many others have been proposed to find the frequent itemsets. Among all the algorithms, the approach of mining closed itemsets has arisen a lot of interests in data mining commun...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- J. Inf. Sci. Eng.
دوره 32 شماره
صفحات -
تاریخ انتشار 2016